Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems

Multi-objective integer or mixed-integer programming problems typically have disconnected feasible domains, making the task of constructing an approximation Pareto front challenging. The present article shows that certain algorithms were originally devised for continuous can be successfully adapted to approximate integer, and mixed-integer, multi-objective problems. Relationships amongst various scalarization techniques are established motivate choice a particular in these algorithms. proposed tested by means two-, three- four-objective problems, comparisons made. In particular, new algorithm is used solve rocket injector design problem with discrete variable, which challenging problem.